Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
81	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
82	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
83	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem
84	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
85	Prague-Sum_abstract_Kreml.dvi Add to Reading List Source URL: www.prague-sum.com Language: English - Date: 2014-08-20 03:18:27 Fluid dynamics Bernhard Riemann Computational fluid dynamics Fluid mechanics Riemann problem Incompressible flow Physics Continuum mechanics Aerodynamics
86	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
87	2nd Student Workshop on Ecology and Optics of Coastal Zones, 2016 Kaliningrad, Russia, 19-23 JulyCLUSTER-BASED APPROACH TO THE SOLUTION OF THE INVERSE Add to Reading List Source URL: www.earsel.org Language: English - Date: 2016-06-28 13:11:01 Chemistry Statistics Applied mathematics Artificial neural networks Computational neuroscience Raman scattering Mathematical psychology Self-organizing map Chemometrics Raman spectroscopy Salt Inverse problem
88	CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-26 12:53:21 Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem
89	MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and Add to Reading List Source URL: www.keisu.t.u-tokyo.ac.jp Language: English - Date: 2013-01-25 04:57:12 Computational complexity theory Mathematics Operations research Algebra Linear algebra Linear complementarity problem Mathematical optimization Linear programming NP Inequality Time complexity LCP array
90	Service Retrieval Based on Behavioral Specification and Quality Requirements Daniela Grigori, Veronika Peralta, Mokrane Bouzeghoub PRISM, University of Versailles, France Add to Reading List Source URL: bpm2005.loria.fr Language: English - Date: 2005-09-12 10:45:10 Mathematics Graph theory Computational complexity theory NP-complete problems Subgraph isomorphism problem Graph isomorphism Matching Graph Vertex Induced subgraph isomorphism problem Graph coloring

UPDATE